By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

ALERT ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.

Table of Contents
What Article options are available ?   View Cart   

Irregular Assignments of Trees and Forests

M. Aigner and E. Triesch

pp. 439-449

The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees

David J. Aldous

pp. 450-465

A Characterization of an Extension of the Banzhaf Value to Multicandidate Voting Games

E. M. Bolger

pp. 466-477

Binary Probabilities Induced by Rankings

Peter C. Fishburn

pp. 478-488

Thicknesses of Ordered Sets

Peter C. Fishburn

pp. 489-501

Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints

Martin Grötschel and Clyde L. Monma

pp. 502-523

Vertex Transitivity and Super Line Connectedness

Yahya Ould Hamidoune and Ralph Tindell

pp. 524-530

The Domatic Number Problem in Interval Graphs

Tung-Lin Lu, Pei-Hsin Ho, and Gerard J. Chang

pp. 531-536

Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments

Y. Manoussakis and Z. Tuza

pp. 537-543

Cycle Lengths and Graph Orientations

Oliver Pretzel and Dale Youngs

pp. 544-553

A Minimax Arc Theorem for Reducible Flow Graphs

Vijaya Ramachandran

pp. 554-560

Generating Permutations with $k$-Differences

Carla D. Savage

pp. 561-573

On the Number of Distinct Forests

Lajos Takács

pp. 574-581

A Simplified Anomaly and Reduction for Precedence Constrained Multiprocessor Scheduling

Craig A. Tovey

pp. 582-584

River Routing with a Small Number of Jogs

Tai-Ching Tuan and S. Louis Hakimi

pp. 585-597